Smallest Color-Spanning Objects

نویسندگان

  • Manuel Abellanas
  • Ferran Hurtado
  • Christian Icking
  • Rolf Klein
  • Elmar Langetepe
  • Lihong Ma
  • Belén Palop
  • Vera Sacristán Adinolfi
چکیده

Motivated by questions in location planning, we show for a set of colored point sites in the plane how to compute the smallest (by perimeter or area) axis-parallel rectangle, the narrowest strip, and other smallest objects enclosing at least one site of each color.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle

Given a set of n colored points with a total of m > 3 colors in 2D, the problem of identifying the smallest color-spanning object is studied. We have considered two different shapes: (i) corridor, and (ii) rectangle of arbitrary orientation. Our proposed algorithm identifies the narrowest color-spanning corridor in O(n2 log n) time using O(n) space. Our proposed algorithm for identifying minimu...

متن کامل

Rheinische Friedrich - Wilhelms - Universität Bonn

Given n point sites in the plane each painted in one of k colors, the region of a c-colored site p in the Farthest Color Voronoi Diagram (FCVD) contains all points of the plane for which c is the farthest color and p the nearest c-colored site. This novel structure generalizes both the standard Voronoi diagram (k = 1) and the farthest site Voronoi diagram (k = n). We show that the FCVD has stru...

متن کامل

On Heterochromatic Out-directed Spanning Trees in Tournaments

Given a tournament T , let h(T ) be the smallest integer k such that every arc-coloring of T with k or more colors produces at least one out-directed spanning tree of T with no pair of arcs with the same color. In this paper we give the exact value of h(T ).

متن کامل

Graph-Based Segmentation Methods for Planar and Spatial Images

1.1 The aim in this section is to present a new and efficient graph-based method to detect visual objects from digital color images and to extract their color and geometric features, in order to determine later the contours of the visual objects and to perform syntactic analysis of the determined shapes. The presented method is a general-purpose segmentation method and it produces good results ...

متن کامل

Boundary-Spanning in NIOC’s research projects: Literature meta-synthesis and the direction of future research

The complex and ambiguous nature of innovative activities has forced organizations to think beyond their conventional boundaries. In this regard, inter-organizational projects are carried out with the aim of developing complex technological systems, changing organizational routines and developing capabilities. Designing and implementing inter-organizational projects creates many inter-organizat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001